Two-agent single-machine scheduling with release times and deadlines

Single-machine scheduling with stepwise tardiness costs and release times

We study a scheduling problem that belongs to the yard operations component of the railroad planning problems, namely the hump sequencing problem. The scheduling problem is characterized as a single-machine problem with stepwise tardiness cost objectives. This is a new scheduling criterion which is also relevant in the context of traditional machine scheduling problems. We produce complexity re...

Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations

We present an algorithm that finds an optimal schedule on a single processor for a given set of processes such that each process starts executing after its release time and completes its computation before its deadline, and a given set of precedence relations and a given set of exclusion relations defined on ordered pairs of process segments are satisfied. This algorithm can be applied to the i...

On scheduling a single machine with resource dependent release times

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

Two-Processor Scheduling with Start-Times and Deadlines

Given a set 3-= {T1, T2, , T,} of tasks, each T/having execution time 1, an integer start-time si-> 0 and a deadline di> 0, along with precedence constraints among the tasks, we examine the problem of determining whether there exists a schedule on two identical processors that executes each task in the time interval between its start-time and deadline. We present an O(n 3) algorithm that constr...